Dense arbitrarily partitionable graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense arbitrarily partitionable graphs

A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + · · · + nk = n, there exists a partition (V1, . . . , Vk) of the vertex set V (G) such that Vi induces a connected subgraph of order ni for i = 1, . . . , k. In this paper we show that every connected graph G of order n ≥ 22 and with ‖G‖ >

متن کامل

Dense Arbitrarily Vertex Decomposable Graphs

A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that n1 + · · · + nk = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ni vertices. The main result of the paper reads as follows. Suppose that G is a connected graph o...

متن کامل

On the structure of arbitrarily partitionable graphs with given connectivity

A graph G = (V , E) is arbitrarily partitionable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected subgraphs. Such a graph models, e.g., a computer network which may be arbitrarily partitioned into connected subnetworks. In this paper we study the structure of such graphs and...

متن کامل

On three polynomial kernels of sequences for arbitrarily partitionable graphs

A graph G is arbitrarily partitionable if every sequence (n1, n2, ..., np) of positive integers summing up to |V (G)| is realizable in G, i.e. there exists a partition (V1, V2, ..., Vp) of V (G) such that Vi induces a connected subgraph of G on ni vertices for every i ∈ {1, 2, ..., p}. Given a family F(n) of graphs with order n ≥ 1, a kernel of sequences for F(n) is a set KF (n) of sequences su...

متن کامل

Antitwins in partitionable graphs

Undefined standard terminology can be found in [3]. Berge [l] proposed to call a graph G perfect if for every induced subgraph H of G the vertices of H can be coloured with a number of colours equal to the maximum size of a clique of H, in such a way that no two adjacent vertices are assigned the same colour. Later on, Berge [2] conjectured that a graph is perfect if and only if it contains no ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 2016

ISSN: 1234-3099,2083-5892

DOI: 10.7151/dmgt.1833